Online Maximum Directed Cut

نویسندگان

  • Amotz Bar-Noy
  • Michael Lampis
چکیده

We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio of 3 √ 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Directed Cuts in Graphs with Degree Constraints

The Max Cut problem is an NP-hard problem and has been studied extensively. Alon et al. studied a directed version of the Max Cut problem and observed its connection to the Hall ratio of graphs. They proved, among others, that if an acyclic digraph has m edges and each vertex has indegree or outdegree at most 1, then it has a directed cut of size at least 2m/5. Lehel et al. extended this result...

متن کامل

Cut-Matching Games on Directed Graphs

We give O(log n)-approximation algorithm based on the cut-matching framework of [10, 13, 14] for the computing the sparsest cut on directed graphs. Our algorithm uses only O(log n) single commodity max-flow computations and thus breaks the multicommodity-flow barrier for computing the sparsest cut on directed graphs.

متن کامل

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

We consider the problem of finding the minimum capacity cut in a directed network G with n nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum cut separating a designated source node s from a designated sink node t, and by varying the sink node one...

متن کامل

Computing the Minimum Cut and Maximum Flow of Undirected Graphs

This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge in the graph, one in each way. We prese...

متن کامل

Online formative assessments: exploring their educational value

Introduction: Online formative assessments (OFA’s) have beenincreasingly recognised in medical education as resources thatpromote self-directed learning. Formative assessments are usedto support the self-directed learning of students. Online formativeassessments have been identified to be less time consuming withautomated feedback. This pilot study aimed to determine whetherparticipation and pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009